github.com/andybalholm/brotli.blockEncoder.bits_ (field)

20 uses

	github.com/andybalholm/brotli (current package)
		brotli_bit_stream.go#L1113: 	bits_             []uint16
		brotli_bit_stream.go#L1125: 		self.bits_ = self.bits_[:0]
		brotli_bit_stream.go#L1177: 		writeBits(uint(self.depths_[ix]), uint64(self.bits_[ix]), storage_ix, storage)
		brotli_bit_stream.go#L1202: 		writeBits(uint(self.depths_[ix]), uint64(self.bits_[ix]), storage_ix, storage)
		brotli_bit_stream.go#L1213: 	if cap(self.bits_) < int(table_size) {
		brotli_bit_stream.go#L1214: 		self.bits_ = make([]uint16, table_size)
		brotli_bit_stream.go#L1216: 		self.bits_ = self.bits_[:table_size]
		brotli_bit_stream.go#L1222: 			buildAndStoreHuffmanTree(histograms[i].data_[0:], self.histogram_length_, alphabet_size, tree, self.depths_[ix:], self.bits_[ix:], storage_ix, storage)
		brotli_bit_stream.go#L1234: 	if cap(self.bits_) < int(table_size) {
		brotli_bit_stream.go#L1235: 		self.bits_ = make([]uint16, table_size)
		brotli_bit_stream.go#L1237: 		self.bits_ = self.bits_[:table_size]
		brotli_bit_stream.go#L1243: 			buildAndStoreHuffmanTree(histograms[i].data_[0:], self.histogram_length_, alphabet_size, tree, self.depths_[ix:], self.bits_[ix:], storage_ix, storage)
		brotli_bit_stream.go#L1255: 	if cap(self.bits_) < int(table_size) {
		brotli_bit_stream.go#L1256: 		self.bits_ = make([]uint16, table_size)
		brotli_bit_stream.go#L1258: 		self.bits_ = self.bits_[:table_size]
		brotli_bit_stream.go#L1264: 			buildAndStoreHuffmanTree(histograms[i].data_[0:], self.histogram_length_, alphabet_size, tree, self.depths_[ix:], self.bits_[ix:], storage_ix, storage)